A decomposition theorem for probabilistic transition systems
نویسندگان
چکیده
منابع مشابه
A Decomposition Theorem for Probabilistic Transition Systems
In this paper we prove that every nite Markov chain can be de composed into a cascade product of a Bernoulli process and several simple permutation reset deterministic automata The original chain is a state homomorphic image of the product By doing so we give a positive answer to an open question stated in Paz concerning the decomposability of probabilistic systems Our result is based on the ob...
متن کاملA behavioural pseudometric for probabilistic transition systems
Discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper we present a pseudometric on a class of probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on a metric on the space of Bor...
متن کاملGSOS for Probabilistic Transition Systems
We introduce PGSOS, an operator specification format for (reactive) probabilistic transition systems which bears similarity to the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the up-to-context proof principle is valid. Moreover, guarded recursive equations...
متن کاملGSOS for probabilistic transition systems ( extended abstract )
We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the up-to-context proof principle is valid. Moreover, every s...
متن کاملXPL: An extended probabilistic logic for probabilistic transition systems
Generalized Probabilistic Logic (GPL) is a temporal logic, based on the modal mu-calculus, for specifying properties of reactive probabilistic systems. GPL is expressive enough that termination of Recursive Markov Chains (RMCs) can be cast as a model checking problem over GPL. In this paper, we explore XPL, an extension to GPL for expressing properties of transition systems with probabilistic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00004-g